System for radio transmission of digital signals between a plurality of subscriber stations and base station

ABSTRACT

The new CDMA (Code Division Multiple Access) system structure which is equivalent to the structure of a CDMA system operating with direct code spread (DS, Direct Sequence) but operates with multicarrier (MC) methods. The multicarrier method is introduced a suitable selection of the spread code, with the result that the production of signals in CDMA systems with DS and with MC is harmonized and JD (Joint Detection) multisubscriber detection methods, which are known per se, with or without diversity reception can be used.

BACKGROUND OF THE INVENTION

The invention relates to a system for transmitting digital signals by radio between a plurality of subscriber stations and a base station using a multicarrier code division multiple access method.

In many radio transmission systems, particular in modern mobile radio systems, the allocated frequency bands have to be used as efficiently as possible because of the restricted number of frequencies available. Furthermore, radio transmission systems, in particular of the mobile kind, must be configured in such a way that mutual interference is so minimal that they can be operated one next to the other. In particular in mobile radio systems there are two further relatively serious difficulties, namely on the one hand the problem of multiple access (MA), which arises owing to the simultaneous transmission of a plurality of signals which are assigned to subscribers which are respectively active and which use the same RF carrier, and on the other hand the equalization problem which arises owing to the frequency-selectivity of the radio channel. Code Division Multiple Access, also referred to as CDMA, is a known and convenient solution of the multiple access problem. In CDMA radio systems, a plurality of subscribers transmit their subscriber signals in a common RF frequency band over a time-variant and frequency-selective radio channel. However, time-variant mutual interference, which is referred to as Multiple Access Interference (MAI) may arise between the simultaneously transmitted signals and can be reduced by means of suitable signal separation techniques. In addition, in CDMA radio systems, time-variant Intersymbol Interference (ISI) may arise between the data symbols which are successively transmitted by one specific subscriber. The signal mixture arising at the receiver can be evaluated by means of individual subscriber detection or advantageously separated by means of algorithms for multisubscriber detection. This separation is advantageous in terms of the implementation of CDMA systems in particular in terrestrial mobile radio because it is possible to dispense with complex methods for power control and for soft handover. In addition, diversity reception, for example as a result of the use of a plurality of receiver antennas (antenna diversity) is advantageous since it enables the transmission quality to be improved. CDMA systems with direct code spread (DS, Direct Sequence), diversity reception and multisubscriber detection are known. An advantageous method which is applied successfully in DS-CDMA systems for multisubscriber detection is the so-called JD (Joint Detection) method which is described, for example, in the essay by P. Jung, B. Steiner: “Konzept eines CDMA-Mobilfunksystems mit gemeinsamer Detektion für die dritte Mobilfunkgeneration [Concept of a CDMA mobile radio system with common detection for the third mobile radio generation]”, Parts 1 and 2, “Nachrichtentech., Elektron. [Telecommunications, electronics]”, SCIENCE, Berlin 45 (1995) 1, pages 10 to 14 and 2, pages 24 to 27. An important advantage of such CDMA systems is the utilization of frequency diversity and interference diversity. A disadvantage with DS-CDMA systems is the low degree of influence on the dividing up and allocation of the frequency resource. Combining CDMA systems with multicarrier (MC) methods eliminates this disadvantage.

Multicarrier transmission methods have their origin in the orthogonal frequency division multiplexing (OFDM) technique. In OFDM, the carrier bandwidth B_(u) which is assigned to a particular subscriber k is divided up into Q_(T) subcarriers, lying one next to the other, with identical bandwidth B_(s). This results in:

B_(U)=Q_(T)·B_(s)  (1)

In order to permit overlapping subcarriers which are orthogonal with respect to the data symbol period T_(s), the bandwidth B_(s) equal to 1/T_(s) is selected. Orthogonal subcarriers facilitate the use of receivers of simple design. Below, it is assumed that k subscribers transmit N, to the base m, complex data symbols d _(n)(K), n=1 . . . N within the time period T_(bu). The data symbols d _(n) ^((k)), n=1 . . . N are taken from the complex set

V={v ₁,v ₂ . . . v _(m)}, v _(μ)εC, μ=1 . . . m, mεIN  (2).

The transmission takes place via the RF carrier with the bandwidth B_(u) specified in equation (1). With OFDM, the following applies:

Q_(T)=N  (3).

Each data symbol d _(n) ^((k)) is assigned here to a particular subcarrier. For this reason, all the data symbols d _(n) ^((k)) are transmitted simultaneously during the previously mentioned time period T_(bu). The symbol period T_(s) is thus equal to the time period T_(bu) in OFDM.

The energy of MC-CDMA signals is restricted in spectral terms very well to the assigned RF carrier with the bandwidth B_(u), which is due to the closeness to OFDM. Thus, adjacent channel interference is very low. This fact is very advantageous in terms of the coexistence of the systems. Furthermore, the spectra of MC-CDMA signals in the band B_(u) are rather white, which is favorable in terms of equalization and detection. The fading phenomena experienced by each subcarrier are largely frequency-unselective because the bandwidth of each subcarrier B_(s) is usually narrower than the coherent bandwidth B_(c) of a mobile radio channel. This absence of frequency-selectivity in conjunction with the orthogonality of the subcarriers make it possible to use simple suboptimum detectors in MC-CDMA. Since a data symbol d _(n) ^((k)) is assigned to a single subcarrier in OFDM, OFDM has a low frequency diversity capacity. On the other hand, in MC-CDMA, a data symbol d _(n) ^((k)) is transmitted over Q subcarriers simultaneously where 1<Q≦Q_(T), which permits good utilization of frequency diversity. If frequency gaps are inserted between the Q subcarriers to which a particular data symbol d _(n) ^((k)) is allocated, the frequency diversity behavior can easily be brought about, which additionally increases the flexibility of the system. For example, subcarriers assigned to other data symbols d _(n) ^((k)), n′≈n can be assigned in the frequency gaps between the previously mentioned Q subcarriers. The technique of frequency diversity is not considered further below. Instead, it is assumed that all the Q subcarriers assigned to a specific data symbol d _(n) ^((k)) are adjacent, which still permits frequency diversity to be utilized provided provision is made to ensure that Q·B_(s) exceeds the coherence bandwidth B_(c). MC-CDMA is also beneficial with interference diversity because K>1 subscribers actively use the same Q subcarriers simultaneously. Interference diversity is the key feature in achieving a high spectral efficiency η.

Existing system concepts for CDMA systems with multicarrier (MC) methods are not suitable for general use in mobile radio. Structures for CDMA systems with multicarrier (MC) methods have existed hitherto only for environments with low time variance and negligible intersymbol interference. Algorithms for multisubscriber detection have hitherto been proposed and investigated only for the downlink (from the base station to the subscriber stations). Until now, only conventional individual subscriber detectors have been proposed and investigated for the uplink (from the subscriber station to the base station) which is rarely considered because it is more complex. Diversity reception, for example Coherent Receiver Antenna Diversity (CRAD) in such CDMA systems with multicarrier methods has not been investigated to date.

The relation between the number Q_(T) of all the subcarriers on the RF frequency band B_(u) and the number Q of the subcarriers assigned to a particular data symbol d _(n) ^((k)) is as follows in MC-CDMA:

Q_(T)=Q·N_(s)  (4).

In the equation (4), N_(s) signifies the number of data symbols d _(n) ^((k)) transmitted simultaneously by a subscriber k. The data symbol period length is thus $\begin{matrix} {T_{s} = {\frac{T_{bu}}{N} \cdot {N_{s}.}}} & (5) \end{matrix}$

For given values of B_(u) and T_(bu), a MC-CDMA system concept depends on the selection of Q and N_(s).

Different selections of Q and N_(s) lead to possible MC-CDMA concepts with particular features. Given a known possible MC-CDMA concept, N_(s)=N, which means that all the data symbols d _(n) ^((k)) are transmitted simultaneously. In addition, with this known concept B_(s)=B_(u)/(Q·N) and T_(s)=T_(bu) apply. According to a series of investigations of MC-CDMA, this known concept facilitates the advantageous avoidance of time-variable intersymbol interference by introducing protective intervals of the period length T_(g)>T_(M) (T_(M)=duration of the channel pulse response) However, the introduction of protective intervals can be used only to a certain extent if T_(s)>>T_(g). In mobile radio environments, the length T_(M) of the channel pulse response is in the order of magnitude of between several microseconds and several tens of microseconds, which requires a data symbol period length of T_(s)>100 μs.

SUMMARY OF THE INVENTION

The invention is based on the object of replacing inflexible CDMA system structures with multicarrier methods by a more flexible CDMA system structure with multicarrier methods, which is generally suitable for mobile-radio. This new system structure is intended to permit the specific advantages of CDMA (frequency diversity, interference diversity) to be combined with the advantage of multicarrier methods (flexible allocation of the frequency resource) and to allow both for multiple access interference (MAI) and intersymbol interference (ISI). The intention is that diversity reception will be allowed for explicitly. In addition, the new structures specified by the invention are intended to harmonize CDMA systems with DS (Direct Sequence) and with multicarrier methods, which then permits flexible CDMA systems to be implemented more favorable in terms of expenditure and allows the production of signals in CDMA systems with DS and with multicarrier methods to be harmonized. In addition, the invention is intended to make available suitable algorithms for multisubscriber detection for application in CDMA systems with multicarrier methods and diversity reception. It is intended that it will be possible to use these algorithms both for the uplink and for the down-link.

In general terms the present invention is a system for transmitting digital signals by radio between a plurality of subscriber stations and a base station using MC-CDMA (Multicarrier-Code Division Multiple Access) method in which a plurality of useful links are processed simultaneously in a common RF frequency band. Data blocks of finite length, which can be represented by data vectors

d ^((k))=(d ₁ ^((k)),d ₂ ^((k)) . . . d _(N) ^((k)))^(T, d) _(n) ^((k))εV, V⊂C, k=1 . . . K, n=1 . . . N, K, NεIN

composed in each case of N complex data symbols d _(n) ^((k)) to the base m with a data symbol period length T_(s), are transmitted by the K subscriber stations with the application of a spread code, assigned to the respective subscriber station k, k=1 . . . K, with Q subcarriers distributed uniformly within the RF frequency band. They are decoded again at the reception site using this spread code and by means of a CDMA detector device. The number of data symbols d _(n) ^((k)) transmitted simultaneously by a specific subscriber station k is one and thus all the data symbols d _(n) ^((k)) of a subscriber station are transmitted successively. This transmission takes place using the Q subcarriers of the bandwidth B_(s)=B_(u)/Q=1/T_(s), the subcarriers numbered with q, q=1 . . . Q each having a single center of frequency f_(q), q=1 . . . Q, in accordance with ${f_{q} = \frac{q - 1}{T_{s}}},{q = {1\quad \ldots \quad {Q.}}}$

Each data symbol d _(n) ^((k)) of a subscriber station is spread over all the Q subcarriers of the bandwidth B_(s) by using a subscriber-specific signature code sequence

c ^((k))=(c ₁ ^((k)),c ₂ ^((k)) . . . c _(Q) ^((k)))^(T), c _(q) ^((k))εV_(c), V_(c)⊂C, k=1 . . . K, q=1 . . . Q, K, QεIN

composed of chips c ₁ ^((k)), each chip being assigned to a particular subcarrier. A subscriber station k, k=1 . . . K transmits a linearly modulated signal which is given in the equivalent low-pass filter region by ${{\underset{\_}{d}}^{(k)}(t)} = {\sum\limits_{n = 1}^{N}{{\underset{\_}{d}}_{n}^{(k)} \cdot {{{\underset{\_}{c}}^{(k)}\left( {{t - {\left\lbrack {n - 1} \right\rbrack T_{s}}};{\underset{\_}{c}}^{(k)}} \right)}.}}}$

The linear MC-CDMA spread modulation is formed by sampling of c ^((k)) (t; c ^((k))) made at a rate 1/T_(c), the sampled values ζ_(q) ^((k)), q=1 . . . Q, K produced by means of these samplings giving rise to vectors

ζ^((k))=(ζ₁ ^((k)), ζ₂ ^((k)) . . . ζ_(Q) ^((k))) ^(T), ζ_(q) ^((k))εC, k=1 . . . K, q=1 . . . Q, K, QεIN

A relation between the vectors ζ^((k)) and the spread code vectors c ^((k)) is given by means of the equation ζ^((k))=D c ^((k)) with a matrix ${\underset{\_}{D}\left( {\underset{\_}{D}}_{\alpha,\beta} \right)},{{\underset{\_}{D}}_{\alpha,\beta} = {\frac{1}{\sqrt{Q}}\quad \exp \left\{ {j\quad \frac{2\quad \pi}{Q}\quad \left( {\alpha - 1} \right)\left( {\beta - 1} \right)} \right\}}},\alpha,{\beta = {1\quad \ldots \quad Q}}$

of the inverse discrete Fourier transformation (IDFT), the vector matrix ζ^((k)) containing Q column vectors

δ^((q))=(δ₁ ^((q)), δ₂ ^((q)) . . . δ_(Q) ^((q)))^(T),

${{\underset{\_}{\delta}}_{\alpha}^{(q)} = {\frac{1}{\sqrt{Q}}\quad \exp \left\{ {j\quad \frac{2\quad \pi}{Q}\quad \left( {\alpha - 1} \right)\left( {q - 1} \right)} \right\}}},$

α=1 . . . Q, so that D=(δ⁽¹⁾, δ⁽²⁾ . . . δ^((Q))

and thus

ζ^((k))=(c ₁ ^((k)) δ⁽¹⁾+c ₂ ⁽²⁾ δ⁽²⁾+ . . . +c_(Q) ^((k)) δ^((Q)))

is obtained. In view of the fact that each chip c_(q) ^((k)) is assigned to a particular subcarrier q, the equation ζ^((k))=D c ^((k)) is to be interpreted in such a way that the columns δ^((q)), q=1 . . . Q of the matrix D represent the Q subcarriers and the rows of the matrix D represent the Q time moments within the data symbol period length T_(s) during which sampled values are taken. The result of the equation ζ^((k))=D c ^((k)) is thus a vector ζ^((k)) with elements ζ_(q) ^((k)) which result from a linear combination of the chips c _(q) ^((k)).

The system is utilized in a CDMA system with multicarrier method and coherent receiver antenna diversity (CRAD).

The system has a CDMA detector device at the receive end of a station, having K_(a) receiver antennas, for determining the estimated values

{circumflex over (d)}^((k))=({circumflex over (d)}^((k)), {circumflex over (d)}₂ ^((k)) . . . {circumflex over (d)}_(N) ^((k)))^(T), {circumflex over (d)}_(n) ^((k))εC, k=1 . . . K, n=1 . . . N, K, N ε IN,

of the data symbol sequences d^((k)) a received signal vector e, which results from

e=(e ^((1)T), e ^((2)T) . . . e ^((Ka)T))^(T)=(e ₁, e ₂ . . . _(−K) _(a) _(·(N·Q+W−1)))^(T)=A d +n, K_(a),N,Q,W ε IN,

where the combined K_(a)·(N·Q+W−1)xK·N channel matrix A contains all the K·K_(a) combined channel pulse responses

b ^((k,k) ^(_(a)) ⁾=(b ₁ ^((k,k) ^(_(a)) ⁾,b ₂ ^((k,k) ^(_(a)) ⁾ . . . b _(Q+W−1) ^((k,k) ^(_(a)) ⁾)^(T) =h^((k,k) ^(_(a)) ⁾*ζ^((k))

h _(w) ^((k,k) ^(_(a)) ⁾εC, k=1 . . . K, k_(a)=1 . . . K_(a), l=1 . . . Q+W−1, K, K_(a), Q, W∉IN,

W=number of complex sampled values h _(w) ^((k) ^(_(a)) ⁾, and where K_(a) various interference sequences are represented by the combined interference vector

n=(n ^((1)T),n ^((2)T) . . . n ^((K) ^(_(a)) ^()T))^(T)=(n ₁,n ₂ . . . n _(K) _(a) _(·(N·Q+W−1)))^(T), K_(a), N, Q, WεIN

and the data sequence d is represented by the data symbol vector

d=(d ^((1)T),d ^((2)T) . . . d ^((K)T))^(T)=(d ₁,d ₂ . . . d _(K·N))^(T), K, NεIN.

A CDMA detector device for multisubscriber detection (Joint Detection) is provided at the receive end. This detector device operates suboptimally and is based either on a linear equalization or on a decision feedback equalization. The detector device contains a decorrelating, signal-matched filter. On the proviso that the received signal vector e defined by

e=(e ^((1)T),e ^((2)T) . . . e ^((k) ^(_(a)) ^()T))^(T)=(e ₁,e₂ . . . e _(K) _(a) _(·(N·Q+W−1)))^(T)=A d+n,

K_(a), N, Q, W∉IN, is known at the receiver, the operating principle of the JD detector device is specified by a set of equations S{circumflex over (d)}=Me, where S=(S_(i,j)), i,j=1 . . . K·N, a quadratic matrix with K·N rows and K·N columns, M=(M_(i,j)), i=1 . . . K·N, j=1 . . . N·Q+W−1, a K·NxK_(a)·(N·Q+W−1) estimated matrix and {circumflex over (d)}=({circumflex over (d)}₁,{circumflex over (d)}₂ . . . {circumflex over (d)}_(K·N))^(T) is the estimated value of the data vector d defined in the equation for the received signal vector e. A linear data block equalizer with the following quantization stage is provided as CDMA detector device. Value-continuous estimated values of the data symbols are determined in the block equalizer and are combined to form vectors. Value-discrete estimated values of the data symbols are acquired in the quantization stage by quantizing the value-continuous estimated values.

A linear zero forcing block equalizer is used as linear block equalizer.

A minimum mean square error block equalizer is used as the linear block equalizer.

A data block equalizer with quantized feedback is provided as the CDMA detector device.

A zero forcing block equalizer with quantized feedback is provided as data block equalizer.

A minimum mean square error block equalizer with quantized feedback is provided as data block equalizer.

A digital signal processor which contains the CDMA detector device is provided at the receive end.

The signal processor also contains channel estimators.

A microprocessor is provided as the signal processor.

The system is used within the framework of a hybrid multiple access method which consists of a combination of Code Division Multiple Access with multicarrier method, Frequency Division Multiple Access and Time Division Multiple Access.

Antenna diversity is provided at the receive end.

An adaptive diversity with directional antennas is provided, or a non-adaptive diversity with directional antennas is provided.

The data modulation, which has been linear hitherto, is expanded to non-linear data modulation.

Linear spread modulation is expanded to non-linear spread modulation.

The system has a code spread with orthogonal sequences, either in the uplink or in the downlink or in both directions.

The system has a code spread with non-orthogonal sequences, either in the uplink or in the downlink or in both directions.

The system uses binary spread sequences or non-binary spread sequences, for example quaternary spread sequences.

The system is utilized in the field of mobile radio.

The system is utilized in the field of microwave radio.

The system is utilized in the field of satellite radio.

The system is utilized in marine radio.

The system is utilized in a cordless telephone.

The system is utilized in cable television.

The system is utilized in submarine radio.

In the CDMA system according to the invention, the number N_(s) of the data symbols d _(n) ^((k)) transmitted simultaneously by a particular subscriber k is one. For this reason, all the data symbols d _(n) ^((k)) of the subscriber k are transmitted successively. According to the equation (4), Q_(T)=Q and the bandwidth B_(s) of each subcarrier is N times wider than in the known concept. With the CDMA method according to the invention, the data symbol period length T_(s) is equal to T_(bu)/N. Protective intervals between successively transmitted data symbols d _(n) ^((k)) are, however, not introduced for reasons of economy. Owing to the fact that such protective intervals are dispensed with, intersymbol interference (ISI) is indeed caused, but it is allowed for by means of the new system structures according to the invention, as is multiple access interference (MAI).

As has already been stated in conjunction with equations (4) and (5), the suitable selection of Q and N_(s) depends on the environment in which MC-CDMA is to be applied. For example, the respective MC-CDMA system concept must be capable of being operated in mobile radio environments which have a rapid time variance and which occur when the receiver and transmitter are arranged, for example, in high-speed trains, aircraft and satellites with low orbits. The correlation time T_(k) in such mobile radio environments may be in the order of magnitude of only several hundred microseconds. A coherent detection then requires an iteratively improved channel estimation procedure which is based on already detected data symbols {circumflex over (d)}_(n) ^((k)). For this reason, the data symbol length T_(s) in equation (5) should be considerably shorter than the minimum correlation time T_(K). In particular, T_(s) should be in the order of magnitude of several microseconds or at most several tens of microseconds. However, if T_(s) is small, Q_(T) and N_(s) should also be small. Since the known MC-CDMA system concept requires a relatively large T_(s), the latter is disadvantageous for an application in mobile radio. The concept of the system according to the invention fulfills the requirements mentioned above in terms of T_(s).

Advantageous developments, possible embodiments and advantageous application areas of the system according to the invention are as follows.

BRIEF DESCRIPTION OF THE DRAWING

The features of the present invention which are believed to be novel, are set forth with particularity in the appended claims. The invention, together with further objects and advantages, may best be understood by reference to the following description taken in conjunction with the accompanying drawing, in which:

Vectors are represented here in small bold letters and matrices in large bold letters. Complex variables are underlined. The symbols (·)*, (·)^(T), ∥ ∥ and E{·} represent the complex conjugation, the complex transposition, the formation of the vector norm and/or the formation of anticipated values.

The FIGURE shows the block structure of an uplink of a mobile radio system with coherent receiver antenna diversity.

DESCRIPTION OF THE PREFERRED EMBODIMENTS

The CDMA system structure which is produced by the invention and has a multicarrier method (MC) is equivalent to that of a CDMA system with DS (Direct Sequence). In the block structure according to the FIGURE, K mobile subscribers M₁ . . . M_(K) are active simultaneously on the same RF carrier with the bandwidth B_(u). Each mobile subscriber M₁ . . . M_(K) has a single transmitter antenna A₁ . . . A_(k). The transmitted signals are received at K_(a) receiver antennas E₁ . . . E_(K) _(a) in a base station JD receiver BS. Thus, the transmission of the K subscriber signals takes place over K·K_(a) different radio channels with time-variant complex pulse responses

h ^((k,k) ^(_(a)) ⁾(τ, t), k=1 . . . K, k_(a)=1 . . . K_(a), K, K_(a)εIN  (6).

In expression (6), the pulse response h ^((k,k) ^(_(a)) ⁾ (τ, t) relates to the connection between the subscriber k and the receiver antenna E_(k) _(a) on the one hand and the base station BS on the other. In expression (6), τ designates the delay parameter which relates to the time spread, i.e. the distortion, of the transmitted signal owing to multipath reception, and t designates the real time relating to the time variation of the radio channel.

The production of the MC-CDMA signals assigned to a mobile subscriber k, k=1 . . . K is described below. The following mathematical representation of the MC-CDMA signals is the reason both for the discrete-time model representation described later and for the particular multisubscriber detection (JD=Joint Detection), which is also described later and which has receiver antenna diversity. As has already been stated, each subscriber transmits k finite data sequences

d ^((k))=(d ₁ ^((k)),d ₂ ^((k)) . . . d _(N) ^((k)))^(T′), d _(n) ^((k))εV, V⊂C, k=1 . . . K, n=1 . . . N, K, NεIN  (7).

Each data sequence d ^((k)) is composed of N complex data symbols d _(n) ^((k)) to the base m, with a data symbol period length T_(s). The data symbols d _(n) ^((k)) are taken from a finite complex set V according to the expression (2).

Transmission takes place using Q_(T)=Q subcarriers of the bandwidth B_(s)=B_(u)/Q=1/T_(s). The Q subcarriers are numbered with q, q=1 . . . Q. Each subcarrier q has a single center of frequency f_(q), q=1 . . . Q which is selected according to $\begin{matrix} {{f_{q} = \frac{q - 1}{T_{s}}},{q = {1\quad \ldots \quad {Q.}}}} & (8) \end{matrix}$

According to the relation (8), the first subcarrier of the bandwidth 1/T_(s) has the center of frequency f₁=0, the second subcarrier of the bandwidth 1/T_(s) has the center of frequency f₂=1/T_(s), the third subcarrier of the bandwidth 1/T_(s) has the center of frequency f₃=2/T_(s), and so on.

It follows from the relation (8) that the center of frequency of the RF carrier with the bandwidth B_(u) is $\begin{matrix} {f_{c} = {\frac{Q - 1}{2 \cdot T_{s}} \neq 0.}} & (9) \end{matrix}$

In the equivalent low-pass region which is considered in the following calculations, the center of frequency f_(c) of the RF carrier is therefore not equal to zero.

The center frequency f_(q), given by the equation (8), of the subcarrier q which is represented by the weighted complex sinusoidal

(1/{square root over (Q)})exp{j2πf_(g)t}

results in a phase displacement equal to 2·π·(q−1) during the data symbol period T_(s). The factor

(1{square root over (Q)}) in (1/{square root over (Q)})exp{j2πf_(g)t}

is required for energy normalization. Each data symbol d _(n) ^((k)), n=1 . . . N of a subscriber k is spread over all Q subcarriers of the bandwidth B_(s)=1/T_(s) by using the user-specific signature sequence

c ^((k))=(c ₁ ^((k)),c ₂ ^((k)) . . . c _(Q) ^((k)))^(T), c _(q) ^((k))εV _(c), V _(c)⊂C, k=1 . . . K, q=1 . . . Q, K, QεIN  (10).

in order to permit coexistence of K simultaneously transmitted subscriber signals on the same carrier of the bandwidth B_(u). The complex signature elements c _(q) ^((k)) of the equation (10) which are to the {tilde over (m)} base are designated as chips. The chips c _(q) ^((k)) are taken from the complex set

V _(c)={v _(c,1),v _(c,2) . . . v _(c,{tilde over (m)})}v _(c,μ)εC, μ=1 . . . {tilde over (m)}, {tilde over (m)}εIN  (11).

Each chip c _(q) ^((k)), q=1 . . . Q, is assigned to a particular subcarrier q. This means that the chip c ₁ ^((k)) is assigned to the subcarrier 1, the chip c ₂ ^((k)) is assigned to the subcarrier 2, the chip c ₃ ^((k)) is assigned to the subcarrier 3 etc. With f_(q) according to the relation (8), the spread modulation of the data symbol d _(n) ^((k)) is given by the time-delayed version c ^((k))(t−[n−1]T_(s);c ^((k))) of $\begin{matrix} \begin{matrix} {{{\underset{\_}{c}}^{(k)}\left( {t;{\underset{\_}{c}}^{(k)}} \right)} = \quad {{rect}{\left\{ {\frac{t}{T_{s}} - \frac{1}{2}} \right\} \cdot \frac{1}{\sqrt{Q}} \cdot}}} \\ {\quad {\sum\limits_{q = 1}^{Q}{{\underset{\_}{c}}_{q}^{(k)} \cdot {{\exp\left\lbrack {{j2\pi}\quad f_{q}t} \right\}}.}}}} \end{matrix} & (12) \end{matrix}$

The basis of the spread modulation is therefore a pulse c ^((k))(t;c ^((k))). The shape of this pulse c ^((k))(t;c ^((k))) is dependent on the selection of the Q center of frequencies f_(q) given in the relation (8) and on the subscriber-specific signature sequence c ^((k)) according to equation (10). According to equation (12), the pulse c ^((k))(t;c ^((k))) is of the length T_(s) and is given by the superimposition of the complex sinusoidal

(1/{square root over (Q)})exp{j2πf_(g)t}, q=1 . . . Q,

which are weighted with chips c _(q) ^((k)) according to equation (10). Since the center of frequencies f_(q) of these subcarriers are selected according to the equation (8), the subcarriers are orthogonal over the time period T_(s).

A subscriber k, k=1 . . . K emits a modulated subscriber signal which is given by $\begin{matrix} {{{\underset{\_}{d}}^{(k)}(t)} = {\sum\limits_{n = 1}^{N}{{\underset{\_}{d}}_{n}^{(k)} \cdot {{\underset{\_}{c}}^{(k)}\left( {{t - {\left\lbrack {n - 1} \right\rbrack T_{s}}};{\underset{\_}{c}}^{(k)}} \right)}}}} & (13) \end{matrix}$

in the equivalent low-pas filter region. d ^((k))(t) is produced by means of linear modulation, cf. equation (13). The modulated subscriber signal d ^((k))(t) is thus specified by means of the superimposition of delayed and weighted pulse replicas c ^((k))(t;c ^((k))) which was presented in equation (13). The modulated subscriber signal d ^((k))(t) represented in equation (13) is produced identically to the way in which subscriber signals are produced in JD-CDMA (Joint Detection CDMA).

K_(a) replicas of the modulated signal d ^((k))(t) specified in the equation (13) are received at the K_(a) receiver antennas E₁ . . . E_(K) _(a) of the base station BS. Each of these K_(a) replicas has been influenced by the radio channels with the pulse responses c ^((k,ka))(τ, t), k fixed, k_(a)=1 . . . K_(a), according to equation (6). At each receiver antenna E_(K) _(a) there are simultaneously K received signals which originate from the K subscribers. These K received signals are superimposed linearly and form a signal mixture. At a different receiver antenna E_(k′) _(a) ≈E_(k) _(a′) , the K received signals originating from the K subscribers differ from those which have been received at the receiver antenna E_(k) _(a) . Thus, K_(a) different signal mixtures which are each assigned to a different receiver antenna are processed by the base station BS. The suitable processing of these K_(a) different signal mixtures facilitates improvement of the implementation in comparison with implementation in a receiver with a single receiver antenna. This improvement of the implementation comprises reducing the signal-to-noise ratio for a given bit error rate P_(b). By processing the K_(a) signal mixtures, the receiver of the base station BS determines the estimated values

 {circumflex over (d)}^((k))=({circumflex over (d)}₁ ^((k)),{circumflex over (d)}₂ ^((k)) . . . {circumflex over (d)}_(N) ^((k)))^(T), {circumflex over (d)}_(n) ^((k))εV, V⊂C, k=1 . . . K, n=1 . . . N, K, NεIN.  (14)

of the data symbol sequences d ^((k)) defined by the equation (7).

The further explanation of the system concept according to the invention is given with reference to a discrete-time model representation.

Each of the K_(a) signal mixtures present at the K, receiver antennas E₁ . . . E_(k) _(a) must be band-limited so that digital signal processing is made possible. The output signal of the filter which is used for this band-limitation is sampled at a rate Q/T_(s) which corresponds to the chip rate 1/T_(c)=Q/T_(s) in JD-CDMA.

The linear MC-CDMA spread modulation which is presented in the equation (12) is formed by sampled values of c ^((k))(t;c ^((k))) taken at a rate 1/T_(c). The sampled values ζ_(q) ^((k)), q=1 . . . Q, which are produced by these samplings form the K vectors

ζ^((k))=(ζ₁ ^((k)), ζ₂ ^((k)) . . . ζ_(Q) ^((k))) ^(T), ζ_(q) ^((k))εC, k=1 . . . K, q=1 . . . Q, K, QεIN  (15).

With the matrix $\begin{matrix} {{\underset{\_}{D}\left( {\underset{\_}{D}}_{\alpha,\beta} \right)},{{\underset{\_}{D}}_{\alpha,\beta} = {\frac{1}{\sqrt{Q}}\quad \exp \left\{ {j\quad \frac{2\quad \pi}{Q}\quad \left( {\alpha - 1} \right)\left( {\beta - 1} \right)} \right\}}},\alpha,{\beta = {1\quad \ldots \quad Q}}} & (16) \end{matrix}$

of the inverse discrete Fourier transformation (IDFT), the relation between ζ^((k)) according to equation (15) and c ^((k)) according to equation (10) is given by

ζ^((k))=D c ^((k))  (17).

The matrix (17) contains the Q column vectors $\begin{matrix} {{{\underset{\_}{\delta}}^{(q)} = \left( {{\underset{\_}{\delta}}_{1}^{(q)},{\delta_{2}^{(q)}\quad \ldots \quad {\underset{\_}{\delta}}_{Q}^{(q)}}} \right)^{T}},{{\underset{\_}{\delta}}_{\alpha}^{(q)} = {\frac{1}{\sqrt{Q}}\quad \exp \left\{ {j\quad \frac{2\quad \pi}{Q}\quad \left( {\alpha - 1} \right)\left( {q - 1} \right)} \right\}}},{\alpha = {1\quad \ldots \quad {Q.}}}} & (18) \end{matrix}$

As a result, the following is obtained:

D=(δ ⁽¹⁾,δ ⁽²⁾ . . . δ ^((Q)))  (19).

Functions (19) and (17) result in:

ζ ^((k))=(c ₁ ^((k)) δ ⁽¹⁾+c ₂ ^((k)) δ ⁽²⁾+ . . . +c _(Q) ^((k)) δ ^((Q)))  (20).

In view of the fact that each chip c _(q) ^((k)) is assigned to a particular subcarrier q, the following interpretation of the equation (17) is simple. The columns δ ^((q)), q=1 . . . Q, of the matrix D represent the Q subcarriers. The rows of the matrix D form the Q time points within the data symbol period T_(s) during which sampled values are taken. The result of the equation (17) is thus a vector ζ ^((k)) with elements ζ _(q) ^((k)) which result from a linear combination of the chips c_(q) ^((k)). The vectors ζ ^((k)), k=1 . . . K, can be viewed as subscriber-specific spread sequences. Thus, the only difference between JD-CDMA and the MC-CDMA system according to the invention lies in the selection of the subscriber-specific spread sequences. In JD-CDMA, the code sequences c ^((k)) are used as subscriber-specific spread sequences, and in MC-CDMA according to the invention the vectors ζ ^((k)) which are obtained from the code sequences c ^((k)) according to equation (17) are used. Thus, the equation (17) represents the linking of JC-CDMA and the MC-CDMA system concept designed according to the invention.

In the MC-CDMA system concept according to the invention, the time variation of a mobile radio channel within the data symbol length T_(s) is negligible. For this reason, in order to aid comprehension, the time-dependence of the channel pulse responses will no longer be given in detail below. The K·K_(a) mobile radio channels have the channel pulse responses

h ^((k,k) ^(_(a)) ⁾=(h ₁ ^((k,k) ^(_(a)) ⁾,h ₂ ^((k,k) ^(_(a)) ⁾ . . . h _(W) ^((k,k) ^(_(a)) ⁾)^(T), h _(w) ^((k,k) ^(_(a)) ⁾εC, k=1 . . . K, k_(a)=1 . . . K_(a), w=1 . . . W, K, K_(a), W∉IN  (21).

Each channel pulse response h ^((k,k) ^(_(a)) ⁾ of the equation (21) is composed of W complex sampled values h _(w) ^((k,k) ^(_(a)) ⁾. In the uplink operating in discrete time, the data symbol sequences d ^((k)) specified in equation (7) in MC-CDMA are transmitted over K·K_(a) discrete-time channels with the combined channel pulse responses

b ^((k,k) ^(_(a)) ⁾=(b ₁ ^((k,k) ^(_(a)) ⁾,b ₂ ^((k,k) ^(_(a)) ⁾ . . . b _(Q+W−1) ^((k,k) ^(_(a)) ⁾)^(T) =h ^((k,k) ^(_(a)) ⁾*ζ^((k))

h _(w) ^((k,k) ^(_(a)) ⁾εC, k=1 . . . K, k_(a)=1 . . . K_(a), l=1 . . . Q+W−1, K, K_(a), Q, W∉IN,  (22),

which are composed of the discrete-time folding of the channel pulse response h ^((k,k) ^(_(a)) ⁾, represented in equation (21), with the subscriber-specific spread sequences ζ ^((k)) defined in the equation (16). Intersymbol interference arises for W>1, and multiple access interference occurs for W>1 and/or for non-orthogonal signature sequences c ^((k)). The discrete-time channels with the combined channel pulse responses b ^((k,k) ^(_(a)) ⁾, k=1 . . . K, K_(a)=1 . . . K_(a), according to the equation (22) are designated as (Q+W−1) path channels. Below, it is assumed that the combined channel pulse responses b ^((k,k) ^(_(a)) ⁾ represented in the equation (22) are known at the receiver, which can be ensured when a perfect channel estimation is used. The channel estimation will not be taken into account below because the effect of channel estimation errors on the data detection is not of interest when the capabilities of different data detectors are being investigated.

The signal mixture which is respectively present at a receiver antenna E_(k) _(a) is represented by the received sequence e ^((k) ^(_(a)) ⁾ of the length (N·Q+W−1). This sequence e ^((k) ^(_(a)) ⁾ contains the data symbol sequences d ^((k)) which are represented in equation (7) and which are disrupted by the previously mentioned additive stationary interference sequence

n ^((k) ^(_(a)) ⁾=(n ₁ ^((k) ^(_(a)) ⁾,n ₂ ^((k) ^(_(a)) ⁾ . . . n _(N·Q+W−1) ^((k) ^(_(a)) ⁾)^(T), n _(n) ^((k) ^(_(a)) ⁾εC, k_(a)=1 . . . K_(a), n=1 . . . N·Q+W−1, K_(a), N, Q, W∉IN  (23)

with the covariance matrix

R _(n) ^((k) ^(_(a)) ⁾=E{n ^((k) ^(_(a)) ⁾ n ^((k) ^(_(a)) ^()*T)}, k_(a)=1 . . . K_(a), K_(a)εIN  (24).

After introduction of the data vector

d=(d ^((1)T),d ^((2)T) . . . d ^((K)T))^(T)=(d ₁,d ₂ . . . d _(K·N))^(T), K, NεIN,  (25)

where

d _(N·(k−1)+n)=^(def) d _(n) ^((k)), k=1 . . . K, n=1 . . . N, K, NεIN,  (26)

and the definition of the (N·Q+W−1)×K·N matrix $\begin{matrix} {{{\underset{\_}{A}}^{(k_{a})} = \left( {\underset{\_}{A}}_{ij}^{(k_{a})} \right)},\begin{matrix} {i = {{1\quad \ldots \quad {N \cdot Q}} + W - 1}} \\ {j = {1\quad \ldots \quad {K \cdot N}}} \end{matrix}} & \text{(27a)} \\ {{\underset{\_}{A}}_{{{Q \cdot {({n - 1})}} + 1},{{N \cdot {({k - 1})}} + n}}^{(k_{a})} = \left\{ \begin{matrix} b_{1}^{({k,k_{a}})} & {for} & {{k = 1},} \\ \quad & \quad & {{k_{a} = {1\quad \ldots \quad K_{a}}},} \\ \quad & \quad & {l = {{1\quad \ldots \quad Q} + W - 1}} \\ \quad & \quad & {{n = {{1\quad...}\quad N}},} \\ 0 & {otherwise} & \quad \end{matrix} \right.} & \text{(27b)} \end{matrix}$

the received sequence can be represented by

e ^((k) ^(_(a)) ⁾=(e ₁ ^((k) ^(_(a)) ⁾,e ₂ ^((k) ^(_(a)) ⁾ . . . e _(N·Q+W−1) ^((k) ^(_(a)) ⁾)^(T)=A ^((k) ^(_(a)) ⁾ d+n ^((k) ^(_(a)) ⁾  (28).

For the sake of easier comprehension of equation (28), the matrix A will be explained further. According to the equation (27a), the matrix A has the following form: $\begin{matrix} {{\underset{\_}{A}}^{(k_{a})} = \begin{pmatrix} {{\underset{\_}{b}}_{1}^{({1,k_{a}})}} & 0 & \cdots & 0 & {{\underset{\_}{b}}_{1}^{({2,k_{a}})}} & 0 & \cdots & 0 \\ {{\underset{\_}{b}}_{2}^{({1,k_{a}})}} & 0 & \cdots & 0 & {\underset{\_}{b}}_{2}^{({2,k_{a}})} & 0 & \cdots & 0 \\ \vdots & \vdots & \vdots & \vdots & \vdots & \vdots & \vdots & \vdots \\ {{\underset{\_}{b}}_{Q}^{({1,k_{a}})}} & 0 & \cdots & 0 & {\underset{\_}{b}}_{Q}^{({2,k_{a}})} & 0 & \cdots & 0 \\ {{\underset{\_}{b}}_{Q + 1}^{({1,k_{a}})}} & {{\underset{\_}{b}}_{1}^{({1,k_{a}})}} & \cdots & 0 & {\underset{\_}{b}}_{Q + 1}^{({2,k_{a}})} & {\underset{\_}{b}}_{1}^{({2,k_{a}})} & \cdots & 0 \\ \vdots & \vdots & \vdots & \vdots & \vdots & \vdots & \vdots & \vdots \\ {{\underset{\_}{b}}_{W + Q - 1}^{({1,k_{a}})}} & {{\underset{\_}{b}}_{W - 1}^{({1,k_{a}})}} & \cdots & 0 & {\underset{\_}{b}}_{W + Q - 1}^{({2,k_{a}})} & {\underset{\_}{b}}_{W - 1}^{({2,k_{a}})} & \cdots & 0 \\ \vdots & \vdots & \vdots & 0 & \vdots & \vdots & \vdots & \vdots \\ 0 & {{\underset{\_}{b}}_{W + Q - 1}^{({1,k_{a}})}} & \cdots & 0 & 0 & {\underset{\_}{b}}_{W + Q - 1}^{({2,k_{a}})} & \cdots & 0 \\ \quad & 0 & 0 & \cdots & 0 & 0 & 0 & \cdots \\ \vdots & \vdots & \vdots & \vdots & \vdots & \vdots & \vdots & \vdots \\ 0 & 0 & \cdots & {{\underset{\_}{b}}_{W + Q - 1}^{({1,k_{a}})}} & 0 & 0 & \cdots & {{\underset{\_}{b}}_{W + Q - 1}^{({K,k_{a}})}} \end{pmatrix}} & \text{(29a)} \end{matrix}$

 A ^((k) ^(_(a)) ⁾=(A ^((1,k) ^(_(a)) ⁾,A ^((2,k) ^(_(a)) ⁾ . . . A ^((K,k) ^(_(a)) ⁾)  (29b)

The matrix A ^((k) ^(_(a)) ⁾ is composed of K sets which comprise N columns. Each set can be considered as an (N·Q+W−1)×N-submatrix A ^((k,k) ^(_(a)) ⁾. The first submatrix A ^((1,k) ^(_(a)) ⁾ is assigned to the subscriber 1, the following submatrix A ^((2,k) ^(_(a)) ⁾ is associated with the transmission of the subscriber 2, and so on. The successive transmission of the N data symbols d _(n) ^((k)) is taken into account within each submatrix A ^((k,k) ^(_(a)) ⁾. The first column of the submatrix A ^((k,k) ^(_(a)) ⁾ always simulates the transmission of d ₁ ^((k)), the second column relates to the transmission of d ₂ ^((k)) and so on. The number of non-negative elements per column is given by the length W of the combined channel pulse responses b ^((k,k) ^(_(a)) ⁾ of the equation (22). Since a new data symbol d _(n) ^((k)) is transmitted every Q chip, the offset of b_(w) ^((k,k) ^(_(a)) ⁾ between adjacent columns of the submatrix A ^((k,k) ^(_(a)) ⁾ is always Q rows for a given w. The effect of the intersymbol interference is simulated by non-zero elements in adjacent columns, but in identical rows of the submatrix A ^((k,k) ^(_(a)) ⁾. The arrangement of the submatrices A ^((k,k) ^(_(a)) ⁾ within the matrix A ^((k) ^(_(a)) ⁾ takes into account the simultaneous reception of K subscriber signals and, for that reason, the presence of multiple access interference.

On the basis of the discussion above, standardized mathematical representation of the case of K_(a) receiver antennas E₁ . . . E_(K) _(a) will now be made. Firstly, the combined K_(a)·(N·Q+W−1)×K·N channel matrix A is defined as follows:

A=(A_(i,j))=(A ^((1)T),A ^((2)T) . . . A ^((K) ^(_(a)) ^()T))^(T), K_(a)εN  (30).

The matrix A contains all the K·K_(a) combined channel pulse responses b ^((k,k) ^(_(a)) ⁾ of the equation (22). As already mentioned previously, the interference sequence n ^((k) ^(_(a)) ⁾, k_(a)=1 . . . K_(a) defined in the equation (23) is present at each of the K_(a) receiver antennas E₁ . . . E_(K) _(a) . The K_(a) different interference sequences are represented by the combined interference vector

n=(n ^((1)T),n ^((2)T) . . . n ^((K) ^(_(a)) ^()T))^(T)=(n ₁,n ₂ . . . n _(K) _(a) _(·(N·Q+W−1)))^(T), K_(a), N, Q, WεIN  (31)

where the following applies

n _((N·Q+W−1)·(k) _(a) _(−1)+n)=^(def) n _(n) ^((k) ^(_(a)) ⁾, k_(a)=1 . . . K_(a), n=1 . . . N·Q+W−1 K_(a), N, Q, WεIN  (32).

The statistical properties of n defined in equation (31) are specified by the following covariance matrix: $\begin{matrix} {{{\underset{\_}{R}}_{n} = {{E\left\{ {\underset{\_}{n}\quad {\underset{\_}{n}}^{*T}} \right\}} = \begin{pmatrix} {\underset{\_}{R}}_{n}^{{(1)}{(1)}} & {\underset{\_}{R}}_{n}^{{(1)}{(2)}} & \cdots & {\underset{\_}{R}}_{n}^{{(1)}{(K_{a})}} \\ {\underset{\_}{R}}_{n}^{{(2)}{(1)}} & {\underset{\_}{R}}_{n}^{{(2)}{(2)}} & \cdots & {\underset{\_}{R}}_{n}^{{(2)}{(K_{a})}} \\ \vdots & \vdots & \cdots & \vdots \\ {\underset{\_}{R}}_{n}^{({K_{a}{K1}})} & {\underset{\_}{R}}_{n}^{{(K_{a})}{(2)}} & \cdots & {\underset{\_}{R}}_{n}^{{(K_{a})}{(K_{a})}} \end{pmatrix}}},} & \text{(33a)} \end{matrix}$

R _(n) ^((i)(j))={n ^((i)) n ^((j)*T)}, i,j=1 . . . K_(a), K_(a) εIN   (33b).

With the combined data sequence d introduced in equation (25), with the combined channel matrix A according to equation (30) and with the combined interference sequence n specified in equation (31), the combined received signal vector is

e=(e^((1)T),e^((2)T) . . . e^((k) ^(_(a)) ^()T))^(T)=(e₁,e₂ . . . e_(K) _(a) _(·(N·Q+W−1)))^(T)=A d+n, K_(a), N, Q, WεIN,  (34)

where

e_((N·Q+W−1)·(k) _(a) _(−1)+n)=^(def)e_(n) ^((k) ^(_(a)) ⁾, k_(a)=1 . . . K_(a), n=1 . . . N·Q+W−1 K_(a), N, Q, WεIN  (35).

The received signal vector e according to equation (34) is then processed in a data detector in order to determine the estimated values {circumflex over (d)}^((k)) defined by equation (14).

A multisubscriber detection (JD=Joint Detection), in particular in conjunction with coherent receiver antenna diversity, for the case of the uplink of MC-CDMA radio systems has to date neither been implemented nor investigated. Suitable techniques for multisubscriber detection, also for application in conjunction with receiver antenna diversity, are proposed below. Since optimum JD techniques are very complex and expensive, only suboptimal methods are treated. Four suboptimal JD techniques which are based on a linear equalization and/or on a decision feedback equalization and can also be used together with coherent receiver antenna diversity are proposed, namely

the so-called linear zero-forcing block equalizer (ZF-BLE=Zero Forcing Block Linear Equalizer), also suitable for coherent receiver antenna diversity,

the so-called Minimum Mean Square Error Block Equalizer (MMSE-BLE=Minimum Mean Square Error Block Linear Equalizer), also suitable for coherent receiver antenna diversity,

the so-called Zero Forcing Block Equalizer with quantized feedback (ZF-BDFE=Zero Forcing Block Decision Feedback Equalizer), also suitable for coherent receiver antenna diversity, and

the so-called Minimum Mean Square Error Block Equalizer with quantized feedback (MMSE-BDFE=Minimum Mean Square Error Block Decision Feedback Equalizer), likewise suitable for coherent receiver antenna diversity.

All four proposed JD techniques contain a decorrelating, signal-matched filter.

Below, it is assumed that the received signal vector e defined by equation (34) is known at the receiver before the data detection is carried out. The basic concept of the JD techniques applied in an MC-CDMA system according to the invention is given by a set of equations

S{circumflex over (d)}=M e  (36)

where

S=(S _(i,j)), i,j=1 . . . K·N,  (37)

is a quadratic matrix with K·N rows and K·N columns

M=(M _(i,j)), i=1 . . . K·N, j=1 . . . N·Q+W−1  (38)

is a K·N×K_(a)·(N·Q+W−1) estimation matrix and

{circumflex over (d)}=({circumflex over (d)}₁,{circumflex over (d)}₂ . . . {circumflex over (d)}_(K·N))^(T)  (39)

is the estimated value of the data vector d defined in equation (25). The selection of the matrices M and S determines the respective technique of multisubscriber detection (JD). The representations of the matrices M and S in the case of ZF-BLE, ZF-BDFE, MMSE-BLE and of MMSE-BDFE are derived below for coherent receiver antenna diversity in each case. The data symbols {circumflex over (d)}_(n) estimated in the estimated value {circumflex over (d)} according to equation (39) are either value-continuous (designated by {circumflex over (d)}_(c,n) and contained in {circumflex over (d)}_(c)) or are value-discrete (designated by {circumflex over (d)}_(q,n) and contained in {circumflex over (d)}_(q)). The value-continuous estimated values {circumflex over (d)}_(c,n) must be quantized so that the desired value-discrete estimate values ({circumflex over (d)}^((1)T),{circumflex over (d)}^((2)T) . . . {circumflex over (d)}^((K)T))^(T) is always identical to the value-discrete estimated value {circumflex over (d)}_(q).

The transmission of data Symbols d _(n) ^((k)) with E{d _(n) ^((k))} equal to zero is assumed below. The implementation which can be achieved by applying a particular JD technique for coherent receiver antenna diversity is dependent on the signal-to-noise ratio γ(k,n) at the output of the JD device for coherent receiver antenna diversity. This signal-to-noise ratio γ(k,n) is determined for each data symbol d _(n) ^((k)) transmitted by a subscriber k. The following applies: $\begin{matrix} {{{\gamma \left( {k,n} \right)} = \frac{{variance}\quad {of}\quad {the}\quad {signal}\quad {component}}{\begin{matrix} {{variance}\quad {of}\quad {the}\quad {noise}} \\ {{and}\quad {interference}\quad {components}} \end{matrix}}}{{{\gamma \left( {k,n} \right)} = \frac{E\left\{ {{\hat{\underset{\_}{d}}}_{{N \cdot {({k - 1})}} + n}}^{2} \right\}_{{{noise} - {free}},{\underset{\_}{d}}_{n\quad {insulated}}^{(k)}}}{E\left\{ {{\hat{\underset{\_}{d}}}_{{N \cdot {({k - 1})}} + n}}^{2} \right\}_{{\underset{\_}{d}}_{n}^{(k)} = 0}}},{k = {1\quad \ldots \quad K}},{n = {1\quad \ldots \quad {N.}}}}} & (40) \end{matrix}$

A decorrelating, signal-matched filter (decorrelating matched filter) which is suitable to be used for coherent receiver antenna diversity is proposed below. Its method of operation requires that A according to equation (30), R _(n) according to equation (33a) and e according to equation (34) are known at the receiver. With the matrix Diag<X _(i,j)>, which designates a diagonal matrix composed only of diagonal elements of the matrix X, and with the so-called Cholesky decomposition

R _(n) ⁻¹=L ^(*T) L,  (41)

where L is an upper triangle matrix

L=(L _(i,j)), L _(i,j)=0∀i>j, i,j=1 . . . K_(a)·(N·Q+W−1)  (42),

the value-continuous output signal of the decorrelating, signal-matched filter for coherent receiver antenna diversity is given by: $\begin{matrix} {{\hat{\underset{\_}{d}}}_{c} = {{\underset{\_}{A}}^{*T}{\underset{\_}{R}}_{n}^{- 1}\underset{\_}{e}}} & \text{(43a)} \\ {\quad {= {{\left( {\underset{\_}{L}\quad \underset{\_}{A}} \right)^{*T}\underset{\_}{L}\quad \underset{\_}{e}}\quad = {\underset{\underset{{useful}\quad {component}}{}}{{Diag}{\langle\left\lbrack {\left( {\underset{\_}{L}\quad \underset{\_}{A}} \right)^{*T}\underset{\_}{L}\quad \underset{\_}{A}} \right\rbrack_{i,j}\rangle}\underset{\_}{d}} +}}}} & \text{(43b)} \\ {\underset{\underset{{intersymbol}\quad {and}\quad {multiple}\quad {access}\quad {interference}}{}}{\left\lbrack {{\left( {\underset{\_}{L}\quad \underset{\_}{A}} \right)^{*T}\underset{\_}{L}\quad \underset{\_}{A}} - {{Diag}{\langle\left\lbrack {\left( {\underset{\_}{L}\quad \underset{\_}{A}} \right)^{*T}\underset{\_}{L}\quad \underset{\_}{A}} \right\rbrack_{i,j}\rangle}}} \right\rbrack}\quad {\underset{\underset{noise}{}}{\left( {\underset{\_}{L}\quad \underset{\_}{A}} \right)^{*T}\underset{\_}{L}\quad \underset{\_}{n}}.}} & \text{(43c)} \end{matrix}$

In the equations (43a) to (43c), [X]_(i,j) signifies the element in the i-th row and the j-th column of the matrix X. According to the equation set (43a) to (43c), the estimated value {circumflex over (d)}_(c) contains both intersymbol and multiple access interference and an interference term assigned to filtered noise. From equation (43b) it follows that S is the K·N×K·N standard matrix I and the estimated matrix M is represented by $\begin{matrix} {\begin{matrix} {\underset{\_}{M} = {\underset{\underset{{matched}\quad {filter}}{}}{\left( {\underset{\_}{L}\quad \underset{\_}{A}} \right)^{*T}}}} & \underset{\underset{{decorrelating}\quad {filter}}{}}{\left( \underset{\_}{L} \right)} \end{matrix}.} & (44) \end{matrix}$

The operation L e decorrelates, i.e. makes the interference white in advance. Thus, L is a white noise prefilter or decorrelation filter. The signal L e is fed to the filter (L A)^(*T) which is-matched to the concatenation of the K·K_(a) discrete-time channels with the combined channel pulse responses b ^((k,k) ^(_(a)) ⁾ of the equation (22) and is matched to the decorrelation filter L. The concatenation of L with (L A)^(*T) is a decorrelating, signal-matched filter.

For the sake of simplicity, the hermitian matrix

E=A ^(*T) R _(n) ⁻¹ A=(L A)^(*T) L A  (45)

is specified. With the proviso that the data symbols d _(n) ^((k)) are sampled values of a steady-state process with the covariance matrix

R _(d)=E{d d ^(*T)}  (46),

the signal-to-noise ratio γ(k,n) at the output of the decorrelating matched filter formulated in the equation (40) is given by $\begin{matrix} {{{\gamma \left( {k,n} \right)} = \frac{E{\left\{ {{\underset{\_}{d}}_{n}^{(k)}}^{2} \right\} \cdot \left( \left\lbrack \underset{\_}{E} \right\rbrack_{v,v} \right)^{2}}}{\begin{matrix} {\left\lbrack {\underset{\_}{E}\quad {\underset{\_}{R}}_{d}\quad \underset{\_}{E}} \right\rbrack_{v,v} + {\left( {1 - {2\quad {Re}\left\{ \left\lbrack {\underset{\_}{E}\quad {\underset{\_}{R}}_{d}} \right\rbrack_{v,v} \right\}}} \right) \cdot}} \\ {\left\lbrack \underset{\_}{E} \right\rbrack_{v,v} + {E{\left\{ {{\underset{\_}{d}}_{n}^{(k)}}^{2} \right\} \cdot \left( \left\lbrack \underset{\_}{E} \right\rbrack_{v,v} \right)^{2}}}} \end{matrix}}}{{v = {{N \cdot \left( {k - 1} \right)} + n}},{k = {1\quad \ldots \quad K}},{n = {1\quad \ldots \quad {N.}}}}} & (47) \end{matrix}$

An important special case is formed by additive white Gaussian noise of the variance σ² and by uncorrelated data symbols, i.e. the covariance matrix R _(d) is equal to the K·N×K·N standard matrix I. In this special case, the estimated matrix M is found to be $\begin{matrix} {\underset{\_}{M} = {\frac{1}{\sigma^{2}}\quad {{\underset{\_}{A}}^{*T}.}}} & (48) \end{matrix}$

According to the equation (48) the decorrelating, matched filter for coherent receiver antenna diversity is composed of K_(a) signal-matched filters assigned to the Ka receiver antennas E₁ . . . E_(K) _(a) .

Equation (47) is furthermore reduced to $\begin{matrix} {{{\gamma \left( {k,n} \right)} = \frac{\left( \left\lbrack {\underset{\_}{A}}^{*T} \right\rbrack_{v,v} \right)^{2}}{\left\lbrack {{\underset{\_}{A}}^{*T}\underset{\_}{A}\quad {\underset{\_}{A}}^{*T}\quad \underset{\_}{A}}\quad \right\rbrack_{v,v} + {\sigma^{2} \cdot \left\lbrack {{\underset{\_}{A}}^{*T}\underset{\_}{A}}\quad \right\rbrack_{v,v}} - \left( \left\lbrack {{\underset{\_}{A}}^{*T}\underset{\_}{A}} \right\rbrack_{v,v} \right)^{2}}},{v = {{N \cdot \left( {k - 1} \right)} + n}},{k = {1\quad \ldots \quad K}},{n = {1\quad \ldots \quad {N.}}}} & (49) \end{matrix}$

The signal-to-noise ratio γ(k,n) specified in equation (47) is a maximum because neither intersymbol interference nor multiple access interference is present. In this case, the equation (47) is reduced to

γ(k,n)=E{|d _(n) ^((k))|²}·[E]_(N·(k−1)+n,N·(k−1)+n), k=1 . . . K, n=1 . . . N  (50).

In the particular case mentioned above of the additive white Gaussian noise and uncorrelated data symbols, equation (50) becomes $\begin{matrix} {{\gamma \left( {k,n} \right)} = {{\frac{1}{\sigma^{2}}\quad\left\lbrack {{\underset{\_}{A}}^{*T}\underset{\_}{A}}\quad \right\rbrack}_{{{N \cdot {({k - 1})}} + n},{{N \cdot {({k - 1})}} + n}} = {\sum\limits_{k_{a} = 1}^{K_{a}}\quad {\frac{{{\underset{\_}{b}}^{({k,k_{a}})}}^{2}}{\sigma^{2}}.}}}} & (51) \end{matrix}$

According to equation (51), the signal-to-noise ratio at the output of the decorrelating signal-matched filter for coherent receiver antenna diversity is the sum of the signal-to-noise ratios at the outputs of the K_(a) signal-matched filters assigned to the K_(a) receiver antennas E₁ . . . E_(K) _(a) .

The so-called linear Zero Forcing Block Equalizer (ZF-BLE), also suitable for coherent receiver antenna diversity, is based on the Gaussian/Markovian estimation. The ZF-BLE equalization minimizes the quadratic form

Q(d _(c))=(e−A d _(c))^(*T) R _(a) ⁻¹(e−Ad _(c))  (52),

where d _(c) is a data vector with value-continuous elements d _(c,n), n=1 . . . K·N. The minimum of Q(d _(c)) is assigned to the estimated value $\begin{matrix} {{{\hat{\underset{\_}{d}}}_{c} = {{\left( {{\underset{\_}{A}}^{*T}{\underset{\_}{R}}_{n}^{- 1}\quad \underset{\_}{A}} \right)^{- 1}{\underset{\_}{A}}^{*T}{\underset{\_}{R}}_{n}^{- 1}\quad \underset{\_}{e}} = {\underset{\_}{d} + \underset{\underset{interference}{}}{\left( {{\underset{\_}{A}}^{*T}{\underset{\_}{R}}_{n}^{- 1}\quad \underset{\_}{A}} \right)^{- 1}{\underset{\_}{A}}^{*T}{\underset{\_}{R}}_{n}^{- 1}\quad \underset{\_}{n}}}}},} & (53) \end{matrix}$

which is value-continuous and true to expectations, of the data vector d which is specified in equation (25). In accordance with equation (53), the estimated value {circumflex over (d)}_(c) is free of intersymbol and multiple access interference, but still contains an interference term which represents the filtered noise.

From equation (53) it follows that S is the K·N×K·N standard matrix I, and the estimated matrix M can be represented as

M=(A ^(*T) R _(n) ⁻¹ A)⁻¹ A ^(*T) R _(n) ⁻¹  (54).

The estimated matrix M can also be developed further. With the Cholesky decomposition

A ^(*T) R _(n) ⁻¹ A=H ^(*T)Σ² H,  (55)

where H is an upper triangle matrix and Σ is a diagonal matrix,

H=(H _(i,j)), H _(i,j)=0∀i>j, H _(i,i)=1 ∀i, i,j=1 . . . K·N,  (56a)

Σ=Diag(σ_(i,j)), σ_(i,j)εIR, i=1 . . . K·N,  (56b)

the equation (54) can be represented as: $\begin{matrix} {\underset{\_}{M} = {\begin{matrix} \underset{\underset{\underset{{multiple}\quad {access}\quad {canceller}}{{intersymbol}\quad {and}}}{}}{\begin{matrix} \left( \Sigma \right. & \left. \underset{\_}{H} \right)^{- 1} \end{matrix}} & \underset{\underset{\underset{filter}{{white}\quad {noise}}}{}}{\begin{matrix} \left( {\underset{\_}{H}}^{*T} \right. & \left. \Sigma \right)^{- 1} \end{matrix}} & \underset{\underset{\underset{filter}{{signal} - {matched}}}{}}{\begin{matrix} \left( \underset{\_}{L} \right. & \left. \underset{\_}{A} \right)^{*T} \end{matrix}} & \underset{\underset{\underset{filter}{decorrelation}}{}}{\left( \underset{\_}{L} \right)} \end{matrix}.}} & (57) \end{matrix}$

As has already been mentioned before, the linear Zero Forcing Block Equalizer (ZF-BLE) contains a decorrelating signal-matched filter which is used for the received signal vector e according to equation (34). The output signal of the decorrelating signal-matched filter is fed into the white noise filter (H ^(*T)Σ)⁻¹. The combination of the filters L, (L A)^(*T) and (H ^(*T)Σ)⁻¹ will be referred to as decorrelating, white-noise, signal-matched filter. At the output of this combined filter, a Maximum Likelihood Sequence Estimator (MLSE) can be used. The expenditure on such a Maximum Likelihood Sequence Estimator (MLSE) is, however, rather high. For this reason, it is more favorable to use a linear intersymbol and multiple access interference canceller, as specified by the expression (Σ H)⁻¹.

With the matrix E defined by equation (45), the signal-no-noise ratio γ(k,n) at the output of the linear Zero Forcing Block Equalizer (ZF-BLE) can be represented by the expression $\begin{matrix} {{{\gamma \left( {k,n} \right)} = \frac{E\left\{ {{\underset{\_}{d}}_{n}^{(k)}}^{2} \right\}^{2}}{\left\lbrack {\underset{\_}{E}}^{- 1} \right\rbrack_{{{N \cdot {({k - 1})}} + n},{{N \cdot {({k - 1})}} + n}}}},{k = {1\quad \ldots \quad K}},{n = {1\quad \ldots \quad N}},K,\quad {N \in {IN}},} & (58) \end{matrix}$

which is generally smaller than γ(k,n) according to equation (50) at the output of the decorrelating signal-matched filter. However, the linear Zero Forcing Block Equalizer (ZF-BLE) operates better than the decorrelating signal-matched filter if the intersymbol interference and multiple access interference are considerable.

In the previously mentioned special case of the additive white Gaussian noise and uncorrelated data symbols, the estimated matrix M according to equation (54) is given by

M=(A ^(*T) A)⁻¹ A ^(*T),  (59)

and equation (58) is reduced to $\begin{matrix} {{{\gamma \left( {k,n} \right)} = \frac{1}{\sigma^{2} \cdot \left\lbrack \left( {{\underset{\_}{A}}^{*T}\quad \underset{\_}{A}} \right)^{- 1} \right\rbrack_{{{N \cdot {({k - 1})}} + n},{{N \cdot {({k - 1})}} + n}}}},{k = {1\quad \ldots \quad K}},{n = {1\quad \ldots \quad N}},K,\quad {N \in {{IN}.}}} & (60) \end{matrix}$

The so-called Zero Forcing Block Equalizer with quantized feedback (ZF-BDFE), also suitable for coherent receiver antenna diversity, will be derived below on the basis of the linear Zero Forcing Block Equalizer (ZF-BLE) just described, suitable for coherent receiver antenna diversity. The derivation of the ZF-BDFE equalizer makes use of the structure of the upper triangle matrix H. With equations (53) and (57) the following applies $\begin{matrix} {{\underset{\_}{H}\quad {\hat{\underset{\_}{d}}}_{c}} = {{{\hat{\underset{\_}{d}}}_{c} + {\left( {\underset{\_}{H} - I} \right){\hat{\underset{\_}{d}}}_{c}}} = {{\Sigma^{- 1}\left( {{\underset{\_}{H}}^{*T}\Sigma} \right)}^{- 1}\left( {\underset{\_}{L}\quad \underset{\_}{A}} \right)^{*T}\underset{\_}{L}\quad \underset{\_}{e}}}} & \text{(61a)} \\ {\quad {{= {\underset{\_}{M}\quad \underset{\_}{e}}},}} & \text{(61b)} \end{matrix}$

where the estimated matrix

M=Σ⁻¹(H ^(*T)Σ)⁻¹(L A)^(*T) L  (62)

is used and I designates the K·N×K·N standard matrix. According to equation (62), the so-called Zero Forcing Block Equalizer with quantized feedback (ZF-BDFE), which is also intended to be suitable for coherent receiver antenna diversity, contains a decorrelating, white noise, signal-matched filter. The equivalencies $\begin{matrix} {{{\hat{\underset{\_}{d}}}_{c,{K \cdot N}} = {\sum\limits_{j = 1}^{K_{a} \cdot {({{N \cdot Q} + W - 1})}}\quad {{\underset{\_}{M}}_{{K \cdot N},j}{\underset{\_}{e}}_{j}}}},} & \text{(63a)} \\ {{{{\hat{\underset{\_}{d}}}_{c,n} + {\sum\limits_{j = {n + 1}}^{K \cdot N}\quad {{\underset{\_}{H}}_{n,j}{\hat{\underset{\_}{d}}}_{c,j}}}} = {\sum\limits_{j = 1}^{K_{a} \cdot {({{N \cdot Q} + W - 1})}}\quad {{\underset{\_}{M}}_{n,j}{\underset{\_}{e}}_{j}}}},{n = {{1\quad \ldots \quad {K \cdot N}} - 1}},} & \text{(63b)} \end{matrix}$

follow from the equation (61b). According to the equation (63a), the estimated value {circumflex over (d)}_(c,K·N) is determined by the linear superimposition of the K_(a)·(N·Q+W−1) weighted elements M _(K·N,j) e _(j). All the other estimated values {circumflex over (d)}_(c,n) are, furthermore, influenced by the H _(n,n+2){circumflex over (d)}_(c,n+2) . . . H _(n,K·N){circumflex over (d)}_(c,K·N), cf. equation (63b). With the proviso that the equation set given in (63a) and (63b) is solved recursively with n decreasing from K·N as far as one, a so-called Zero Forcing Block Equalization with quantized feedback (ZF-BDFE), which is also suitable for coherent receiver antenna diversity, can be implemented. If {circumflex over (d)}_(c,j), j=(n+1) . . . (K·N) in equation (63b) is replaced by the quantized versions {circumflex over (d)}_(q,j), the Zero Forcing Block Equalizer with quantized feedback (ZF-BDFE), also suitable for coherent receiver antenna diversity, is found to be $\begin{matrix} {{{\hat{\underset{\_}{d}}}_{c,{K \cdot N}} = {\sum\limits_{j = 1}^{K_{a} \cdot {({{N \cdot Q} + W - 1})}}\quad {{\underset{\_}{M}}_{{K \cdot N},j}{\underset{\_}{e}}_{j}}}},} & \text{(64a)} \\ {{{{\hat{\underset{\_}{d}}}_{c,n} + {\sum\limits_{j = {n + 1}}^{K \cdot N}\quad {{\underset{\_}{H}}_{n,j}{\hat{\underset{\_}{d}}}_{q,j}}}} = {\sum\limits_{j = 1}^{K_{a} \cdot {({{N \cdot Q} + W - 1})}}\quad {{\underset{\_}{M}}_{n,j}{\underset{\_}{e}}_{j}}}},{n = {{1\quad \ldots \quad {K \cdot N}} - 1.}}} & \text{(64b)} \end{matrix}$

With $\begin{matrix} {\left\lbrack \underset{\_}{x} \right\rbrack_{j}^{i}\overset{def}{=}{{\left( {{\underset{\_}{x}}_{i},{{\underset{\_}{x}}_{i + 1}\quad \ldots \quad {\underset{\_}{x}}_{j}}} \right)^{T}\quad i} \leq j}} & \text{(65a)} \\ {{\left\lbrack \underset{\_}{X} \right\rbrack_{q,j}^{p,i}\overset{def}{=}\begin{pmatrix} {\underset{\_}{X}}_{p,i} & {\underset{\_}{X}}_{p,{i + 1}} & \cdots & {\underset{\_}{X}}_{p,j} \\ {\underset{\_}{X}}_{{p + 1},i} & {\underset{\_}{X}}_{{p + 1},{i + 1}} & \cdots & {\underset{\_}{X}}_{{p + 1},j} \\ \vdots & \vdots & \cdots & \vdots \\ {\underset{\_}{X}}_{q,i} & {\underset{\_}{X}}_{q,{i + 1}} & \cdots & {\underset{\_}{X}}_{q,j} \end{pmatrix}^{T}},{p \leq q},{i \leq j},} & \text{(65b)} \end{matrix}$

the following is obtained from equation (61b) $\begin{matrix} {{\left( {\lbrack I\rbrack_{{K \cdot N},n}^{1,1},\left\lbrack {\underset{\_}{H} - I} \right\rbrack_{{K \cdot N},{K \cdot N}}^{1,{n + 1}}} \right)\left( {\left( \left\lbrack {\hat{\underset{\_}{d}}}_{c} \right\rbrack_{n}^{1} \right)^{T},\left( \left\lbrack {\hat{\underset{\_}{d}}}_{q} \right\rbrack_{K \cdot N}^{n + 1} \right)^{T}} \right)^{T}} = {\underset{\_}{M}\quad {\underset{\_}{e}.}}} & \text{(66a)} \end{matrix}$

$\left\lbrack {\underset{\_}{H} - I} \right\rbrack_{{K \cdot N},{K \cdot N}}^{1,{n + 1}}$

is the feedback operator. The following $\begin{matrix} {{\underset{\_}{S} = \left( {\lbrack I\rbrack_{{K \cdot N},n}^{1,1},\left\lbrack {\underset{\_}{H} - I} \right\rbrack_{{K \cdot N},{K \cdot N}}^{1,{n + 1}}} \right)},} & \text{(67a)} \\ {{\hat{\underset{\_}{d}} = \left( {\left( \left\lbrack {\hat{\underset{\_}{d}}}_{c} \right\rbrack_{n}^{1} \right)^{T},\left( \left\lbrack {\hat{\underset{\_}{d}}}_{q} \right\rbrack_{K \cdot N}^{n + 1} \right)^{T}} \right)^{T}},} & \text{(67b)} \end{matrix}$

reveal the structure of equation (36). Both variables S and {circumflex over (d)} given by the equation set (67a) and (67b) must experience an update at each moment in time nT_(s).

The signal-to-noise ratio γ(k,n) at the output of the ZF-BDFE equalizer is given by

γ(k,n)=E{|d _(n) ^((k))|²}·(σ_(N·(k−1)+n,N·(k−1)+n))², k=1 . . . N, K, NεIN  (68)

with the proviso that all preceding decisions which are fed back are correct. The signal-to-noise ratio γ(k,n) according to equation (68) is generally larger than the signal-to-noise ratio γ(k,n) given by equation (58), at the output of the ZF-BLE equalizer. However, in the case of incorrect preceding decisions, the operation of ZF-BDFE equalizer does suffer propagations of errors. As has already been mentioned, the operation of the ZF-BDFE equalizer can be improved by the application of channel sorting.

Like the linear Zero Forcing Block Equalizer (ZF-BLE), which is also suitable for coherent receiver antenna diversity, and the Zero Forcing Block Equalizer with quantized feedback (ZF-BDFE), which is likewise configured for coherent receiver antenna diversity, the so-called Minimum Mean Square Error Block Equalizer (MMSE-BLE), which is also suitable for coherent receiver antenna diversity, makes use of the knowledge of the matrix A, specified in equation (27a), of the interference signal vector n according to equation (23) and of the received signal vector e introduced according to equation (34). The quadratic form $\begin{matrix} {{Q\left( {\underset{\_}{d}}_{c} \right)} = {E\left\{ {\left( {{\underset{\_}{d}}_{c} - \underset{\_}{d}} \right)^{*T}\left( {{\underset{\_}{d}}_{c} - \underset{\_}{d}} \right)} \right\}}} & \text{(69a)} \\ {\quad {= {E\left\{ {{{\underset{\_}{d}}_{c} - \underset{\_}{d}}}^{2} \right\}}}} & \text{(69b)} \end{matrix}$

must be minimized by means of the MMSE-BLE equalizer. The data vector d _(c) is composed of the value-continuous elements d _(c,n), n=1 . . . K·N. The quadratic form Q(d_(c)) assumes its minimum value when d _(c) is equal to the value-continuous and uninfluenced estimated value $\begin{matrix} {{\hat{\underset{\_}{d}}}_{c} = {{\left( {{{\underset{\_}{A}}^{*T}{\underset{\_}{R}}_{n}^{- 1}\underset{\_}{A}} + R_{d}^{- 1}} \right)^{- 1}{\underset{\_}{A}}^{*T}{\underset{\_}{R}}_{n}^{- 1}\underset{\_}{e}}\quad = \begin{matrix} \underset{\underset{{Wien}\quad {filter}\quad {\underset{\_}{W}}_{0}}{}}{\left( {I + \left( {{\underset{\_}{R}}_{d}\quad {\underset{\_}{A}}^{*T}{\underset{\_}{R}}_{n}^{- 1}\underset{\_}{A}} \right)^{- 1}} \right)^{- 1}} & \underset{\underset{{ZF} - {BLE}}{}}{\left( \quad {{\underset{\_}{A}}^{*T}{\underset{\_}{R}}_{n}^{- 1}\underset{\_}{A}} \right)^{- 1}\quad {\underset{\_}{A}}^{*T}{\underset{\_}{R}}_{n}^{- 1}\underset{\_}{e}} \end{matrix}}} & \text{(70a)} \\ {\quad {= {\underset{\underset{{useful}\quad {component}}{}}{{Diag}{\langle\left\{ {\underset{\_}{W}}_{0} \right\}_{i,j}\rangle}\underset{\_}{d}} + \underset{\underset{\underset{{access}\quad {interference}}{{intersymbol}\quad {and}\quad {multiple}}}{}}{\left\lbrack {{\underset{\_}{W}}_{0} - {{Diag}{\langle\left\{ {\underset{\_}{W}}_{0} \right\}_{i,j}\rangle}}} \right\rbrack \underset{\_}{d}} +}}} & \text{(70b)} \\ \underset{\underset{noise}{}}{{{\underset{\_}{W}}_{0}\left( {{\underset{\_}{A}}^{*T}{\underset{\_}{R}}_{n}^{- 1}\underset{\_}{A}} \right)}^{- 1}{\underset{\_}{A}}^{*T}{\underset{\_}{R}}_{n}^{- 1}\underset{\_}{n}} & \text{(70c)} \end{matrix}$

where I designates the K·N×K·N standard matrix. According to the equation set (70a) to (70c), the estimated value {circumflex over (d)}_(c) contains a useful term, a term relating to the intersymbol and multiple access interference and an interference term and it represents the output signal of the ZF-BLE equalizer which has already been dealt with and downstream of which a Wien filter

W ₀=(I+(R _(d) A ^(*T) R _(n) ⁻¹ A)⁻¹)⁻¹  (71)

is connected. Owing to the equation set (70a) to (70c), S is identical to the K·N×K·N standard matrix Z, and the estimated matrix M can be represented in the form of

M=W ₀(Σ H)⁻¹(H ^(*T)Σ)⁻¹(L A)^(*T) L  (72).

According to equation (72), the MMSE-BLE equalizer contains a decorrelating, signal-matched filter which is used for the received signal vector e according to equation (34). The output signal of the decorrelating, signal-matched filter is fed into the linear intersymbol and multiple access canceller (ΣH)⁻¹ downstream of which the Wien filter W ₀ is connected. Since the Wien filter minimizes the anticipated value of the squared norm of the estimated error vector (d _(c)−d), the MMSE-BLE equalization gives rise to better power than the ZF-BLE equalization, which also applies in the case of coherent receiver antenna diversity. In addition, it is possible to show readily that the estimated errors (d _(c,n)−d _(n)) and the estimated data symbols {circumflex over (d)}_(c,n) at the output of the MMSE equalizer are uncorrelated.

The signal-to-noise ratio γ(k,n) at the output of the MMSE-BLE equalizer is given by the expression $\begin{matrix} {{{\gamma \left( {k,n} \right)} = \frac{E{\left\{ {{\underset{\_}{d}}_{n}^{(k)}}^{2} \right\} \cdot {\left\lbrack {\underset{\_}{W}}_{0} \right\rbrack_{v,v}}^{2}}}{\begin{matrix} {\left\lbrack {{\underset{\_}{W}}_{0}\quad {\underset{\_}{R}}_{d}} \right\rbrack_{v,v} - {2\quad {Re}\left\{ {\left\lbrack {{\underset{\_}{W}}_{0}\quad {\underset{\_}{R}}_{d}} \right\rbrack_{v,v} \cdot} \right.}} \\ {\left. \left\lbrack {\underset{\_}{W}}_{0} \right\rbrack_{v,v}^{*} \right\} + {E{\left\{ {{\underset{\_}{d}}_{n}^{(k)}}^{2} \right\} \cdot {\left\lbrack {\underset{\_}{W}}_{0} \right\rbrack_{v,v}}^{2}}}} \end{matrix}}}{v = {{N \cdot \left( {k - 1} \right)} + n}},{k = {1\quad \ldots \quad K}},{n = {1\quad \ldots \quad N}},K,{N \in {IN}},} & (73) \end{matrix}$

which is generally larger than the signal-to-noise ratio γ(k,n), presented in equation (58), at the output of the ZF-BLE equalizer which has already been described previously.

In the previously mentioned particular case of the additive white Gaussian noise and uncorrelated data symbols, the estimated matrix M is found to be

M=(I+σ²·(A ^(*T) A)⁻¹)⁻¹·(A ^(*T) A)⁻¹ A ^(*T),  (74)

and equation (73) is reduced to $\begin{matrix} {{{\gamma \left( {k,n} \right)} = \frac{\left\lbrack {\underset{\_}{W}}_{0} \right\rbrack_{v,v}}{1 - \left\lbrack {\underset{\_}{W}}_{0} \right\rbrack_{v,v}}},{v = {{N \cdot \left( {k - 1} \right)} + n}},{k = {1\quad \ldots \quad K}},{n = {1\quad \ldots \quad N}},K,{N \in {IN}},} & (75) \end{matrix}$

where W ₀=(I+σ²·(A ^(*T) A)⁻¹)⁻¹.

On the basis of the so-called Minimum Mean Square Error Block Equalizer (MMSE-BLE) which is treated above and which is configured for coherent receiver antenna diversity, the so-called Minimum Mean Square Error Block Equalizer with quantized feedback (MMSE-BDFE), which is also suitable for coherent receiver antenna diversity, will be derived in a similar way, as has already been done for the ZF-BDFE equalizer. With the Cholesky decomposition

A ^(*T) R _(n) ⁻¹ A+R _(d) ⁻¹=(ΣH′)^(*T)ΣH′,  (76)

in which the matrices

H′=(H′_(i,j)), H′_(i,j)=0∀i>j, H′_(i,i)=1∀i, i,j=1 . . . K·N  (77a)

Σ=D iag (σ_(i,i)), σ_(i,i)εIR, i=1 . . . K·N  (77)

are used, and with the estimated matrix

M=Σ⁻¹(H′^(*T)Σ)⁻¹(L A)^(*T) L  (78)

the MMSE-BDFE equalizer can be represented as follows: $\begin{matrix} {{\left( {\lbrack I\rbrack_{{K \cdot N},n}^{1,1},\left\lbrack {{\underset{\_}{H}}^{\prime} - I} \right\rbrack_{{K \cdot N},{K \cdot N}}^{1,{n + 1}}} \right)\left( {\left( \left\lbrack {\hat{\underset{\_}{d}}}_{c} \right\rbrack_{n}^{1} \right)^{T},\left( \left\lbrack {\hat{\underset{\_}{d}}}_{q} \right\rbrack_{K \cdot N}^{n + 1} \right)^{T}} \right)^{T}} = {\underset{\_}{M}\quad {\underset{\_}{e}.}}} & (79) \end{matrix}$

The matrix [H′−I]_(K·N,K·N) ^(1,n+1) represents the feedback operator. The following

S=([I]_(K·N,n) ^(1,1)[H′−I]_(K·N,K·N) ^(1,n+1))  (80a)

{circumflex over (d)}=(([{circumflex over (d)}_(c)]_(n) ¹)^(T),([{circumflex over (d)}_(q)]_(K·N) ^(n+1))^(T))^(T)  (80b)

reveal the structure of the equation (36).

The signal-to-noise ratio γ(k,n) at the output of the MMSE-BDFE equalizer is given by $\begin{matrix} {{{{\gamma \left( {k,n} \right)} = \frac{E{\left\{ {{\underset{\_}{d}}_{n}^{(k)}}^{2} \right\} \cdot {{\left( \sigma_{v,v}^{\prime} \right)^{2}\left\lbrack \left( {{\underset{\_}{H}}^{\prime}{\underset{\_}{R}}_{d}} \right)^{- 1} \right\rbrack}_{v,v}}^{2}}}{\begin{matrix} {{E{\left\{ {{\underset{\_}{d}}_{n}^{(k)}}^{2} \right\} \cdot {\left\lbrack \left( {{\underset{\_}{H}}^{\prime}{\underset{\_}{R}}_{d}} \right)^{- 1} \right\rbrack_{v,v}}^{2}}} -} \\ {{2\quad {Re}\left\{ \left\lbrack \left( {{\underset{\_}{H}}^{\prime}{\underset{\_}{R}}_{d}} \right)^{- 1} \right\rbrack_{v,v} \right\}} + \left( \sigma_{v,v}^{\prime} \right)^{2}} \end{matrix}}}v = {{N \cdot \left( {k - 1} \right)} + n}},{K = {1\quad \ldots \quad K}},{n = {1\quad \ldots \quad N}},K,{N \in {IN}},} & (81) \end{matrix}$

with the proviso that all the preceding decisions which have been fed back are correct. The signal-to-noise ratio γ(k,n) according to equation (81) of the MMSE-BDFE equalizer is generally larger than the signal-to-noise ratio γ(k,n), given by equation (68), of the ZF-BDFE equalizer.

In summary, it is to be noted that the CDMA system structure which is produced by means of the invention is equivalent to that of a CDMA system with DS (Direct Sequence=direct spreading sequence). The introduction of the multicarrier (MC) method is achieved by means of a suitable selection of the spreading code. By means of this procedure according to the invention, on the one hand the production of signals in CDMA systems with DS and with multicarrier (MC) methods is harmonized and, on the other hand, the expansion and application of already known methods for multisubscriber detection (JD=Joint Detection) both with and without diversity reception is made possible in CDMA systems with multicarrier methods.

The fields of application for a system designed according to the invention are, apart from generally in mobile radio, inter alia, for example, microwave radio, satellite radio, marine radio, WLL (Wireless Local Loop), WLAN (Wireless Local Area Network), MBS (Mobile Broadband Systems), FPLMTS (Future Public Land Mobile Telecommunication—Systems, IMT-2000), UMTS (Universal Mobile Telecommunication Systems), PCS (Personal Communication Services), PCN (Personal Communication Networks), cordless telephone equipment (CT), HDTV (High Definition Television), cable television (CATV), RITL (Radio in the Loop), Indoor radio, PABX (Public Access Branch Exchange), submarine radio and deep space communications.

The invention is not limited to the particular details of the apparatus depicted and other modifications and applications are contemplated. Certain other changes may be made in the above described apparatus without departing from the true spirit and scope of the invention herein involved. It is intended, therefore, that the subject matter in the above depiction shall be interpreted as illustrative and not in a limiting sense. 

What is claimed is:
 1. A system for transmitting digital signals by radio between a plurality of subscriber stations and a base station using the so-called MC-CDMA (Multicarrier—Code Division Multiple Access) method in which a plurality of useful links are processed simultaneously in a common RF frequency band, comprising: data blocks of finite length, which can be represented by data vectors d ^((k))=(d ₁ ^((k)),d ₂ ^((k)) . . . d _(N) ^((k)))^(T), d _(n) ^((k))εC, k=1 . . . K, n=1 . . . N, K,N ε IN, each of the data vectors being composed of N complex data symbols d _(n) ^((k)) to the base m with a data symbol period length T_(s); K subscriber stations for transmitting the data blocks with application of a spread code, assigned to a respective subscriber station k, k=1 . . . K, with Q subcarriers distributed uniformly within an RF radio frequency band; a reception site using said spread code and a CDMA detector device for decoding the data blocks; a number of data symbols d _(n) ^((k)) transmitted simultaneously by a specific subscriber station k being one and all the data symbols d _(n) ^((k)) of a subscriber station being transmitted successively; said transmission using the Q subcarriers of bandwidth B_(s)=B_(U)/Q=1/T_(s), the subcarriers numbered with g=1 . . . Q each having a single center of frequency f_(q), q=1 . . . Q, in accordance with ${f_{q} = \frac{q - 1}{T_{s}}},\quad {q = {1\ldots \quad Q}}$

each data symbol d _(n) ^((k)) of a subscriber station being spread over all the Q subcarriers of the bandwidth B_(s) by a subscriber-specific signature code sequence c ^((k))=(c ₁ ^((k)), c ₂ ^((k)) . . . c _(Q) ^((k)))^(T), c_(q) ^((k))εC, k=1 . . . K, q=1 . . . Q, K, QεIN  composed of chips c _(q) ^((k)), each chip being assigned to a particular subcarrier; a linearly modulated signal, which is transmitted by a subscriber station, k, k=1 . . . K which is given in the equivalent low-pass filter region by ${{{\underset{\_}{d}}^{(k)}(t)} = {\sum\limits_{n = 1}^{N}\quad {{\underset{\_}{d}}_{n}^{(k)} \cdot {{\underset{\_}{c}}^{(k)}\left( {{t - {\left\lbrack {n - 1} \right\rbrack T_{s}}};{\underset{\_}{c}}^{(k)}} \right)}}}},$

linear MC-CDMA spread modulation being formed by samplings of a c ^((k)) (t;c ^((k))) made at a rate 1/T_(c), the sampled values ζ _(q) ^((k)), q=1 . . . Q, K produced by these samplings giving rise to vectors ζ ^((k))=(ζ ₁ ^((k)), ζ ₂ ^((k)) . . . ζ _(Q) ^((k)))^(T), ζ _(q) ^((k))εC, k=1 . . . K, q=1 . . . Q, K, QεIN; a relation between the vectors ζ ^((k)) and the spread code vectors c ^((k)) being given the equation ζ ^((k))=D c ^((k)) with a matrix ${\underset{\_}{D} = \left( {\underset{\_}{D}}_{\alpha,\beta} \right)},{{\underset{\_}{D}}_{\alpha,\beta} = {\frac{1}{\sqrt{Q}}\quad \exp \left\{ {j\quad \frac{2\quad \pi}{Q}\quad \left( {\alpha - 1} \right)\left( {\beta - 1} \right)} \right\}}},\alpha,{\beta = {1\quad \ldots \quad Q}}$

of an inverse discrete Fourier transformation (IDFT), a vector matrix ζ ^((k)) containing Q column vectors ${{\underset{\_}{\delta}}^{(q)} = \left( {{\underset{\_}{\delta}}_{1}^{(q)},{{\underset{\_}{\delta}}_{2}^{(q)}\quad \ldots \quad {\underset{\_}{\delta}}_{Q}^{(q)}}} \right)^{T}},{{\underset{\_}{\delta}}_{\alpha(}^{q)} = {\frac{1}{\sqrt{Q}}\quad \exp \left\{ {j\quad \frac{2\quad \pi}{Q}\quad \left( {\alpha - 1} \right)\left( {q - 1} \right)} \right\}}},$

α=1 . . . Q, so that D=(δ ⁽¹⁾, δ ⁽²⁾ . . . δ ^((Q))) and thus ζ ^((k))=(c ₁ ^((k)) δ ⁽¹⁾+c ₂ ^((k)) δ ⁽²⁾+ . . . +c _(Q) ^((k)) δ ^((Q))) is obtained; since each chip c _(q) ^((k)) is assigned to a particular subcarrier q, the equation ζ ^((k))=D c ^((k)) is interpreted such that columns δ ^((q)), q=1 . . . Q of the matrix D represent the Q subcarriers and rows of the matrix D represent Q time moments within the data symbol period length T_(s) during which sampled values are taken; and a result of the equation ζ ^((k))=D c ^((k)) being a vector ζ ^((k)) with elements ζ _(g) ^((k)) which result from a linear combination of the chips c _(q) ^((k)).
 2. The system as claimed in claim 1, wherein the system is a CDMA system with multicarrier method and coherent receiver antenna diversity.
 3. The system as claimed in claim 1 in a CDMA detector device at the receive end of a station, having K_(a) receiver antennas, for determining the estimated values {circumflex over (d)}^((k))=({circumflex over (d)}^((k)), {circumflex over (d)}₂ ^((k)) . . . {circumflex over (d)}_(N) ^((k)))^(T), {circumflex over (d)}_(n) ^((k))εC, k=1 . . . K, n=1 . . . N, K, NεIN, of the data symbol sequences d ^((k)) a received signal vector e, which results from e=(e ^((1)T), e ^((2)T) . . . e ^((k) ^(_(a)) ^()T))^(T)=(e ₁,e ₂. . . _(−K) _(a) _(·(N·Q+W−1)))^(T)=A d+n, K_(a), N, Q, WεIN, where the combined K_(a)·(N·Q+W−1)×K·N channel matrix A contains all K·K_(a) combined channel pulse responses b ^((k,k) ^(_(a)) ⁾=(b ₁ ^((k,k) ^(_(a)) ⁾,b ₂ ^((k,k) ^(_(a)) ⁾ . . . b _(Q+W−1) ^((k,k) ^(_(a)) ⁾)^(T)=h ^((k,k) ^(_(a)) ⁾*ζ ^((k),) h ^((k,k) ^(_(a)) ⁾εC, k=1 . . . K, k_(a)=1 . . . k_(a), 1=1 . . . Q+W−1, K, K_(a), Q, W∉IN, W=number of complex sampled values h _(w) ^((k,k) ^(_(a)) ⁾, and where K_(a) various interference sequences are represented by combined interference vector n=(n ^((1)T),n ^((2)T) . . . n ^((k) ^(_(a)) ^()T))^(T)=(n ₁,n ₂. . . n _(K) _(a) _(·(N·Q+W−1)))^(T), K_(a), N, Q, WεIN and the data sequence d is represented by the data symbol vector d=(d ^((1)T),d ^((2)T) . . . d ^((K)T))^(T)=(d ₁,d ₂. . . d _(K·N))^(T), K, NεIN.
 4. The system as claimed in claim 3, wherein the CDMA detector device is a CDMA detector device for multisubscriber detection (JC, Joint Detection) at the receive end, wherein said detector device operates sub-optimally and is based on one of a linear equalization and a decision feedback equalization, wherein the detector device contains a decorrelating, signal-matched filter, wherein, on a proviso that the received signal vector e defined by e=(e^((1)T),e ^((2)T) . . . e ^((k) ^(_(a)) ^()T))^(T)=(e ₁,e ₂ . . . _(−k) _(a) _(·(N·Q+W−1)))^(T)=A d+n, K_(a), N, Q, WεIN, is known at the receiver, an operating principle of a JD detector device is specified by a set of equations S{circumflex over (d)}=Me, where S=(S _(i,j)), i,j=1 . . . K·N, a quadratic matrix with K·N rows and K·N columns, M=(M _(i,j)), i=1 . . . K·N, j=1 . . . N·Q+W−1, a K·N×K_(a)·(N·Q+W−1) estimated matrix and {circumflex over (d)}=({circumflex over (d)}₁, {circumflex over (d)}₂ . . . {circumflex over (d)}_(K·N))_(T) is an estimated value of the data vector d defined in the equation for the received signal vector e.
 5. The system as claimed in claim 4, wherein the system further comprises a linear data block equalizer with a following quantization stage as the CDMA detector device, when value-continuous estimated values of the data symbols are determined in the block equalizer and are combined to form vectors, and wherein value-discrete estimated values of the data symbols are acquired in the quantization stage by quantizing the value-continuous estimated values.
 6. The system as claimed in claim 5, wherein the linear block equalizer is a linear zero forcing block equalizer.
 7. The system as claimed in claim 5, wherein the linear block equalizer is a minimum mean square error block equalizer.
 8. The system as claimed in claim 4, wherein the linear block equalizer a data block equalizer with quantized feedback.
 9. The system as claimed in claim 8, wherein the linear block equalizer a zero forcing block equalizer with quantized feedback.
 10. The system as claimed in claim 8, wherein the linear block equalizer minimum mean square error block equalizer with quantized feedback.
 11. The system as claimed in claim 1, wherein the system further comprises a digital signal processor which contains the CDMA detector device at the receive end.
 12. The system as claimed in claim 11, wherein the signal processor also contains channel estimators.
 13. The system as claimed in claim 11, wherein the signal processor is a microprocessor.
 14. The system as claimed in claim 1, wherein the system is utilized in the framework of a hybrid multiple access method which consists of a combination of Code Division Multiple Access with multicarrier method, Frequency Division Multiple Access and Time Division Multiple Access.
 15. The system as claimed in claim 1, wherein the system further comprises antenna diversity at the receive end.
 16. The system as claimed in claim 1, wherein the system further comprises an adaptive diversity with directional antennas.
 17. The system as claimed in claim 1, wherein the system further comprises a non-adaptive diversity with directional antennas.
 18. The system as claimed in claim 1, wherein the system further comprises an expansion of the data modulation from linear to non-linear data modulation.
 19. The system as claimed in claim 1, wherein the system further comprises an expansion of linear spread modulation to non-linear spread modulation.
 20. The system as claimed in claim 1, wherein the system further comprises a code spread with orthogonal sequences, in one of an uplink, a downlink in both directions.
 21. The system as claimed in claim 1, wherein the system further comprises a code spread with non-orthogonal sequences, in uplink a downlink and in both directions.
 22. The system as claimed in claim 1, wherein the system further comprises binary spread sequences.
 23. The system as claimed in claim 1, wherein the system further comprises non-binary spread sequences.
 24. The system as claimed in claim 1, wherein the system is utilized for mobile radio.
 25. The system as claimed in claim 1, wherein the system is utilized for microwave radio.
 26. The system as claimed in claim 1, wherein the system is utilized for satellite radio.
 27. The system as claimed in claim 1, wherein the system is utilized for marine radio.
 28. The system as claimed in claim 1, wherein the system is utilized for cordless telephone.
 29. The system as claimed in claim 1, wherein the system is utilized for cable television.
 30. The system as claimed in claim 1, wherein the system is utilized for submarine radio.
 31. The system as claimed in claim 1, wherein the system further comprises quaternary spread sequences. 